منابع مشابه
An almost four-approximation algorithm for maximum weight triangulation
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in triangulation is maximized. We prove an ( √ n) lower bound on the approximation factor for several heuristics: maximum greedy triangulation, maximum greedy spanning tree triangulation and maximum spanning tree triangulatio...
متن کاملA Constant Approximation Algorithm for Maximum Weight Triangulation
The paper is the first report on approximation algorithms for computing the maximum weight triangulation of a set of n points in the plane. We prove an Ω( √ n) lower bound on the approximation factor for several heuristics: maximum greedy triangulation, maximum greedy spanning tree triangulation and maximum spanning tree triangulation. We then propose the Spoke Triangulation algorithm, which al...
متن کاملProgress in Automatic Aerial Triangulation
This paper summarizes the most important conclusions that can be drawn from recent developments in automatic aerial triangulation. The focus of the paper is on a shift from points to linear and areal features. After motivating this shift, the paper deals extensively with the use of control features to recover the exterior orientation parameters. Two different approaches are presented, namely an...
متن کاملOn a linear program for minimum-weight triangulation
Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of effective polynomialtime heuristics that, for many instances, can find the exact MWT. Linear programs (LPs) for MWT are well-studied, but previously no connection was known between any LP and any approximation algorithm or heuristic for MWT. Here we show the first su...
متن کاملMinimum Weight Triangulation by Cutting Out Triangles
We describe a fixed parameter algorithm for computing the minimum weight triangulation (MWT) of a simple polygon with (n− k) vertices on the perimeter and k hole vertices in the interior, that is, for a total of n vertices. Our algorithm is based on cutting out empty triangles (that is, triangles not containing any holes) from the polygon and processing the parts or the rest of the polygon recu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2006
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2005.11.001